generating permutations造句

例句与造句

1. In computing it may be required to generate permutations of a given sequence of values.
2. An alternative to Steinhaus Johnson Trotter is Heap's algorithm, said by Robert Sedgewick in 1977 to be the fastest algorithm of generating permutations in applications.
3. :It seems what you want to do is to generate permutations and then apply a trivial function to compose them ( in your example, concatenation ).
4. In a 1977 review of permutation-generating algorithms, Robert Sedgewick concluded that it was at that time the most effective algorithm for generating permutations by computer.
5. If that's what you mean, then Permutation # Algorithms to generate permutations is for you . talk ) 14 : 32, 20 December 2008 ( UTC)
6. It's difficult to find generating permutations in a sentence. 用generating permutations造句挺难的
7. :: That's a classic way to generate permutations, but there are other ways to do it, see Permutation # Numbering permutations .-- Oskar 02 : 42, 11 July 2008 ( UTC)
8. An obvious way to generate permutations of " n " is to generate values for the Lehmer code ( possibly using the factorial number system representation of integers up to " n " ! ), and convert those into the corresponding permutations.
9. Because this method generates permutations that alternate between being even and odd, it may easily be modified to generate only the even permutations or only the odd permutations : to generate the next permutation of the same parity from a given permutation, simply apply the same procedure twice.
10. It can produce more permutations if one exercises the generator a great many times before starting to use it for generating permutations, but this is a very inefficient way of increasing randomness : supposing one can arrange to use the generator a random number of up to a billion, say 2 30 for simplicity, times between initialization and generating permutations, then the number of possible permutations is still only 2 62.
11. It can produce more permutations if one exercises the generator a great many times before starting to use it for generating permutations, but this is a very inefficient way of increasing randomness : supposing one can arrange to use the generator a random number of up to a billion, say 2 30 for simplicity, times between initialization and generating permutations, then the number of possible permutations is still only 2 62.
12. A randomized algorithm for generating permutations generates an "'unpredictable permutation "'if its outputs are permutations on a set of items ( described by length-" n " binary strings ) that cannot be predicted with accuracy significantly better than random by an adversary that makes a polynomial ( in " n " ) number of queries to the oracle prior to the challenge round, whose running time is relativized by the oracle for the permutation.
13. Given a bound \ scriptstyle \ \ epsilon on the admissible probability of error ( the probability of finding that \ scriptstyle \ \ hat { p } > \ alpha when in fact \ scriptstyle \ p \ leq \ alpha or vice versa ), the question of how many permutations to generate can be seen as the question of when to stop generating permutations, based on the outcomes of the simulations so far, in order to guarantee that the conclusion ( which is either \ scriptstyle \ p \ leq \ alpha or \ scriptstyle \ p > \ alpha ) is correct with probability at least as large as \ scriptstyle \ 1-\ epsilon . ( \ scriptstyle \ \ epsilon will typically be chosen to be extremely small, e . g . 1 / 1000 . ) Stopping rules to achieve this have been developed which can be incorporated with minimal additional computational cost.